854B - Maxim Buys an Apartment - CodeForces Solution

//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int N=1e6+5,mod=1e9+7;
typedef long long ll;
typedef pair<int,int> PII;
void solve()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int mi,mx;
    if(k==0) mi=0,mx=0;
    else
    {
        if(n==k)
        {
            printf("0 0\n");
            return;
        }
        mi=1;
        int a=n-k,b=k;
        mx=min(b,a/2)*2+a%2;
        mx=min(mx,b*2);
    }
    printf("%d %d\n",mi,mx);
}
int main()
{
    int t=1;
    //scanf("%d",&t);
    while(t--) solve();
    return 0;
}